n = int(input())
if n % 3 == 0:
b = n // 3
elif n % 3 == 2:
b = n // 3 + 1
else:
b = n // 3
a = b // 12
b %= 12
print(a, b)#include <bits/stdc++.h>
using namespace std;
int main() {
// your code goes here
int n;
cin>>n;
int x=n/36;
if(x==0){
int y=n/3;
int z=n%3;
if(z==2){
if((y+1)==12)
cout<<1<<" "<<0;
else
cout<<0<<" "<<y+1;
}
else cout<<0<<" "<<y;
}
else{
int w=n-(x*36);
int d=w/3;
int q=w%3;
if(q==2){
if(d+1==12)
cout<<x+1<<" "<<0;
else
cout<<x<<" "<<d+1;
}
else{
cout<<x<<" "<<d;
}
}
return 0;
}
MATCHES Playing with Matches | HRDSEQ Hard Sequence |
DRCHEF Doctor Chef | 559. Maximum Depth of N-ary Tree |
821. Shortest Distance to a Character | 1441. Build an Array With Stack Operations |
1356. Sort Integers by The Number of 1 Bits | 922. Sort Array By Parity II |
344. Reverse String | 1047. Remove All Adjacent Duplicates In String |
977. Squares of a Sorted Array | 852. Peak Index in a Mountain Array |
461. Hamming Distance | 1748. Sum of Unique Elements |
897. Increasing Order Search Tree | 905. Sort Array By Parity |
1351. Count Negative Numbers in a Sorted Matrix | 617. Merge Two Binary Trees |
1450. Number of Students Doing Homework at a Given Time | 700. Search in a Binary Search Tree |
590. N-ary Tree Postorder Traversal | 589. N-ary Tree Preorder Traversal |
1299. Replace Elements with Greatest Element on Right Side | 1768. Merge Strings Alternately |
561. Array Partition I | 1374. Generate a String With Characters That Have Odd Counts |
1822. Sign of the Product of an Array | 1464. Maximum Product of Two Elements in an Array |
1323. Maximum 69 Number | 832. Flipping an Image |